Switching Flow-Graph nonlinear modeling technique

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Switching Flow-Graph nonlinear modeling technique - Power Electronics, IEEE Transactions on

A unified graphical modeling technique, “Switching Flow-Graph” is developed to study the nonlinear dynamic behavior of pulse-width-modulated (PWM) switching converters. Switching converters are variable structure systems with linear subsystems. Each subsystem can be represented by a flow-graph. The Switching Flow-Graph is obtained by combining the flowgraphs of the subsystems through the use of...

متن کامل

Behavior Generation using Model Switching A Hybrid Bond Graph Modeling Technique

This paper discusses a technique for modeling discontinuous physical systems that combines the bond graph energy-ow modeling scheme with a signal-ow modeling scheme augmented with nite state automata. It enables the generation of complex, multi-mode behaviors without violating the energy ow principles imposed by bond graphs. Mode switching is achieved by controlled junctions which can take on o...

متن کامل

Simplified nonlinear modeling of river flow routing

Article history: Received 25 February 2010 Received in revised form 31 May 2010 Accepted 2 June 2010 Available online 10 June 2010

متن کامل

Switching Level Modeling and Operation of Unified Power Flow Controller

This proposed work aims at forming a switching level modeling of Unified Power Flow Controller (UPFC) and analyzing its operation. The switching level modeling of UPFC is carried out using high power electronic devices such as IGBT based six pulse shunt and series converters. The operating performance of UPFC is demonstrated on Single Machine Infinite Bus (SMIB) system for different case studie...

متن کامل

A Visual Modeling Technique for Controlling Graph Transformation

Graph grammars and graph transformation systems [9] have turned out to be applicable for solving various problems of recent computer science [3][4]. It is also known, however, that pure graph grammars are often no suitable solutions for practical problems, because graph grammar derivations (as any grammar derivations) are of non-deterministic nature whilst deterministic and predictable behavior...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Transactions on Power Electronics

سال: 1994

ISSN: 0885-8993,1941-0107

DOI: 10.1109/63.318899